A birthday holiday problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Birthday Problem

We study a k-dimensional generalization of the birthday problem: given k lists of n-bit values, find some way to choose one element from each list so that the resulting k values xor to zero. For k = 2, this is just the extremely well-known birthday problem, which has a square-root time algorithm with many applications in cryptography. In this paper, we show new algorithms for the case k > 2: we...

متن کامل

The Birthday Problem and Generalizations

The question that we began our comps process with, the Birthday Problem, is a relatively basic problem explored in elementary probability courses. To solve it, we find the probability that in a group of n people, two of them share the same birthday. The reason this problem is intriguing is that the probability values that we get as a result of our solution are much different that what one may e...

متن کامل

The matching, birthday and the strong birthday problem: a contemporary review

This article provides a contemporary exposition at amoderately quantitative level of the distribution theory associated with the matching and the birthday problems. A large number of examples, many not well known, are provided to help a reader have a feeling for these questions at an intuitive level. © 2004 Elsevier B.V. All rights reserved.

متن کامل

A non-uniform birthday problem with applications to discrete logarithms

We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling coloured balls and placing them in urns, such that the distribution of assigning balls to urns depends on the colour of the ball. We determine the expected number of trials until two balls of differe...

متن کامل

Death takes a holiday

control may kick in even before a kinetochore is assembled. The mitotic checkpoint— controlled by Mad1, Mad2, Bub1, BubR1, and Bub3— delays anaphase by inhibiting APC until all kinetochores are properly attached to the spindle. Because inhibition of Mad2 leads to an accelerated mitosis and a precocious anaphase, it has been assumed that the checkpoint itself also regulates mitotic timing. But M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory

سال: 1968

ISSN: 0021-9800

DOI: 10.1016/s0021-9800(68)80019-5